Star Coloring and Acyclic Coloring of Locally Planar Graphs
نویسندگان
چکیده
It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is acyclically 7-colorable and that its star chromatic number is at most 2s * 0 + 3, where s * 0 ≤ 20 is the maximum star chromatic number for the class of all planar graphs.
منابع مشابه
Coloring with no 2-Colored P4's
A proper coloring of the vertices of a graph is called a star coloring if every two color classes induce a star forest. Star colorings are a strengthening of acyclic colorings, i.e., proper colorings in which every two color classes induce a forest. We show that every acyclic k-coloring can be refined to a star coloring with at most (2k2 − k) colors. Similarly, we prove that planar graphs have ...
متن کاملRestricted Coloring Problems and Forbidden Induced Subgraphs
An acyclic coloring of a graph is a proper coloring such that any two color classes induce a forest. A star coloring of a graph is an acyclic coloring with the further restriction that the forest induced by any two color classes is a disjoint collection of stars. We consider the behavior of these problems when restricted to certain classes of graphs. In particular, we give characterizations of ...
متن کاملAcyclically 3-Colorable Planar Graphs
In this paper we study the planar graphs that admit an acyclic 3-coloring. We show that testing acyclic 3-colorability is NP-hard, even for planar graphs of maximum degree 4, and we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Further, we show that every planar graph has a subdivision with one vertex per edge that admits an acyclic 3-colori...
متن کاملAcyclic chromatic index of triangle-free 1-planar graphs
An acyclic edge coloring of a graph G is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index χa(G) of a graph G is the least number of colors in an acyclic edge coloring of G. It was conjectured that χa(G) ≤ ∆(G) + 2 for any simple graph G with maximum degree ∆(G). A graph is 1-planar if it can be drawn on the plane such that every edg...
متن کاملVertex-Coloring with Star-Defects
Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure. Due to its important applications, as for example in the bipartisation of graphs, this type of coloring has been extensively studied, mainly with respect to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 24 شماره
صفحات -
تاریخ انتشار 2010